Faster Ate Pairing Computation over Pairing-Friendly Elliptic Curves Using GLV Decomposition
نویسندگان
چکیده
منابع مشابه
Computing the Ate Pairing on Elliptic Curves
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves with k = 12. The case k = 9 has not been studied in the literature, and so it is not clear how efficiently pairings can be computed in that case. In this paper, we present efficient methods for the k = 9 case, includin...
متن کاملPairing computation for elliptic curves
This paper presents the first study of pairing computation on curves with embedding degree 15. We show that pairing computation on these curves has loop length r and we use a twist of degree 3 to perform most of the operations in Fp or Fp5 . Furthermore, we present an original arithmetic for extension fields of degree 5. Key-words: Pairing based cryptography, Pairing computation, Arithmetic, In...
متن کاملFast hashing onto pairing-friendly elliptic curves over ternary fields
We propose a fast cryptographic hash algorithm that maps arbitrary messages onto points of pairing-friendly elliptic curves defined over F3m , a core operation in many pairing-based cryptosystems. Our scheme runs in time O(m2), while the best previous algorithm for this task runs in time O(m3). Experimental data confirms the speedup by a factor O(m), or approximately a hundred times for practic...
متن کاملConstructing Families of Pairing-Friendly Elliptic Curves
We present a general method for constructing families of elliptic curves with prescribed embedding degree and prime order. We demonstrate this method by constructing curves of embedding degree k = 10, a value which has not previously appeared in the literature, and we show that our method applies to existing constructions for k = 3, 4, 6, and 12. We give evidence that our method is unlikely to ...
متن کاملHeuristics on pairing-friendly elliptic curves
We present a heuristic asymptotic formula as x → ∞ for the number of isogeny classes of pairing-friendly elliptic curves over prime fields with fixed embedding degree k ≥ 3, with fixed discriminant, with rho-value bounded by a fixed ρ0 such that 1 < ρ0 < 2, and with prime subgroup order at most x.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2013
ISSN: 1225-6463
DOI: 10.4218/etrij.13.0112.0756